Vehicular networks have attracted increasing attention from both the academy and industry. Applications of vehicular\nnetworks require efficient data communications between vehicles, whose performance is concerned with delivery\nratio, delivery delay, and routing cost. The most previous work of routing in vehicular networks assumes oversimplified\nnode mobility when evaluating the performance of vehicular networks, e.g., random mobility or artificial movement\ntraces, which fails to reflect the inherent complexity of real vehicular networks. To understand the achievable\nperformance of vehicular networks under real and complex environments, we first comprehensively analyze the\naffecting factors that may influence the performance of vehicular networks and then introduce four representative\nrouting algorithms of vehicular networks, i.e., Epidemic, AODV, GPSR, and MaxProp. Next, we develop an NS-2\nsimulation framework incorporating a large dataset of real taxi GPS traces collected from around 2,600 taxis in\nShanghai, China. With this framework, we have implemented the four routing protocols. Extensive trace-driven\nsimulations have been performed to explore the achievable performance of real vehicular networks. The impact of\nthe controllable affecting factors is investigated, such as number of nodes, traffic load, packet TTL, transmission range,\nand propagation model. Simulation results show that a real vehicular network has surprisingly poor data delivery\nperformance under a wide range of network configurations for all the routing protocols. This strongly suggests that\nthe challenging characteristics of vehicular networks, such as unique node mobility, constraints of road topology,\nneed further exploration.
Loading....